منابع مشابه
The Extended Centralizer of a Ring over a Module
In a recent paper,1 K. Asano gave a new proof of the theorem that a domain of integrity has a right quotient ring if and only if every pair of nonzero elements has a common nonzero right multiple. His method of proof is used in the present work to extend the centralizer of a ring over a module to a system of semi-endomorphisms of the module. From this extension, necessary and sufficient conditi...
متن کاملthe effect of classroom observation on eflteachers skills ans students outcomes
abstract the following study, in the first place, attempted to examine the effect of less experienced teachers participation in experienced teachers classes on their own skills and teaching methodology, in the second place, attempted to find out the role of teachers training in students achievements. for this purpose, 21 efl teachers were selected according to available sampling in kish l...
On the Security of O-PSI a Delegated Private Set Intersection on Outsourced Datasets (Extended Version)
In recent years, determining the common information privately and efficiently between two mutually mistrusting parties have become an important issue in social networks. Many Private set intersection (PSI) protocols have been introduced to address this issue. By applying these protocols, two parties can compute the intersection between their sets without disclosing any information about compone...
متن کاملThe Centralizer Decomposition of Bg
Let G be a compact Lie group and p a fixed prime number. Recall that an elementary abelian p-group is an abelian group isomorphic to (Z/p) for some r. Jackowski and McClure showed in [10] how to decompose the classifying space BG at the prime p as a homotopy colimit of spaces of the form BCG(V ), where V is a nontrivial elementary abelian p-subgroup of G and CG(V ) is the centralizer of V in G ...
متن کاملOn the dimension of twisted centralizer codes
Given a field F , a scalar λ ∈ F and a matrix A ∈ F, the twisted centralizer code CF (A, λ) := {B ∈ F | AB − λBA = 0} is a linear code of length n. When A is cyclic and λ 6= 0 we prove that dimCF (A, λ) = deg(gcd(cA(t), λcA(λt))) where cA(t) denotes the characteristic polynomial of A. We also show how CF (A, λ) decomposes, and we estimate the probability that CF (A, λ) is nonzero when |F | is f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1974
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1974.53.163